134 research outputs found
MARGIN: Uncovering Deep Neural Networks using Graph Signal Analysis
Interpretability has emerged as a crucial aspect of machine learning, aimed
at providing insights into the working of complex neural networks. However,
existing solutions vary vastly based on the nature of the interpretability
task, with each use case requiring substantial time and effort. This paper
introduces MARGIN, a simple yet general approach to address a large set of
interpretability tasks ranging from identifying prototypes to explaining image
predictions. MARGIN exploits ideas rooted in graph signal analysis to determine
influential nodes in a graph, which are defined as those nodes that maximally
describe a function defined on the graph. By carefully defining task-specific
graphs and functions, we demonstrate that MARGIN outperforms existing
approaches in a number of disparate interpretability challenges.Comment: Technical Repor
Local, Smooth, and Consistent Jacobi Set Simplification
The relation between two Morse functions defined on a common domain can be
studied in terms of their Jacobi set. The Jacobi set contains points in the
domain where the gradients of the functions are aligned. Both the Jacobi set
itself as well as the segmentation of the domain it induces have shown to be
useful in various applications. Unfortunately, in practice functions often
contain noise and discretization artifacts causing their Jacobi set to become
unmanageably large and complex. While there exist techniques to simplify Jacobi
sets, these are unsuitable for most applications as they lack fine-grained
control over the process and heavily restrict the type of simplifications
possible.
In this paper, we introduce a new framework that generalizes critical point
cancellations in scalar functions to Jacobi sets in two dimensions. We focus on
simplifications that can be realized by smooth approximations of the
corresponding functions and show how this implies simultaneously simplifying
contiguous subsets of the Jacobi set. These extended cancellations form the
atomic operations in our framework, and we introduce an algorithm to
successively cancel subsets of the Jacobi set with minimal modifications
according to some user-defined metric. We prove that the algorithm is correct
and terminates only once no more local, smooth and consistent simplifications
are possible. We disprove a previous claim on the minimal Jacobi set for
manifolds with arbitrary genus and show that for simply connected domains, our
algorithm reduces a given Jacobi set to its simplest configuration.Comment: 24 pages, 19 figure
Lose The Views: Limited Angle CT Reconstruction via Implicit Sinogram Completion
Computed Tomography (CT) reconstruction is a fundamental component to a wide
variety of applications ranging from security, to healthcare. The classical
techniques require measuring projections, called sinograms, from a full
180 view of the object. This is impractical in a limited angle
scenario, when the viewing angle is less than 180, which can occur due
to different factors including restrictions on scanning time, limited
flexibility of scanner rotation, etc. The sinograms obtained as a result, cause
existing techniques to produce highly artifact-laden reconstructions. In this
paper, we propose to address this problem through implicit sinogram completion,
on a challenging real world dataset containing scans of common checked-in
luggage. We propose a system, consisting of 1D and 2D convolutional neural
networks, that operates on a limited angle sinogram to directly produce the
best estimate of a reconstruction. Next, we use the x-ray transform on this
reconstruction to obtain a "completed" sinogram, as if it came from a full
180 measurement. We feed this to standard analytical and iterative
reconstruction techniques to obtain the final reconstruction. We show with
extensive experimentation that this combined strategy outperforms many
competitive baselines. We also propose a measure of confidence for the
reconstruction that enables a practitioner to gauge the reliability of a
prediction made by our network. We show that this measure is a strong indicator
of quality as measured by the PSNR, while not requiring ground truth at test
time. Finally, using a segmentation experiment, we show that our reconstruction
preserves the 3D structure of objects effectively.Comment: Spotlight presentation at CVPR 201
- …